A convergent overlapping domain decomposition method for total variation minimization
نویسندگان
چکیده
منابع مشابه
A convergent overlapping domain decomposition method for total variation minimization
In this paper we are concerned with the analysis of convergent sequential and parallel overlapping domain decomposition methods for the minimization of functionals formed by a discrepancy term with respect to the data and a total variation constraint. To our knowledge, this is the first successful attempt of addressing such a strategy for the nonlinear, nonadditive, and nonsmooth problem of tot...
متن کاملDomain Decomposition Methods for Total Variation Minimization
Domain decomposition methods are well-known techniques to address a very large scale problem by splitting it into smaller scale sub-problems. The theory of such methods is fully clarified when the energy minimized by the method is either smooth and strictly convex or splits additively with respect to the decomposition. Otherwise counterexamples to convergence exist. In this talk we present a co...
متن کاملA strongly convergent primal-dual method for nonoverlapping domain decomposition
We propose a primal-dual parallel proximal splitting method for solving domain decomposition problems for partial differential equations. The problem is formulated via minimization of energy functions on the subdomains with coupling constraints which model various properties of the solution at the interfaces. The proposed method can handle a wide range of linear and nonlinear problems, with fle...
متن کاملNon-Overlapping Domain Decomposition Methods For Dual Total Variation Based Image Denoising
In this paper non-overlapping domain decomposition methods for the pre-dual total variation minimization problem are introduced. Both parallel and sequential approaches are proposed for these methods for which convergence to a minimizer of the original problem is established. The associated subproblems are solved by a semi-smooth Newton method. Several numerical experiments are presented, which...
متن کاملA Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2010
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-010-0314-7